Edge disjoint placement of graphs
نویسندگان
چکیده
منابع مشابه
Edge-disjoint spanners of complete bipartite graphs
A spanning subgraph S=(V; E′) of a connected simple graph G=(V; E) is an (x+c)-spanner if for any pair of vertices u and v; dS(u; v)6dG(u; v)+c where dG and dS are the usual distance functions in graphs G and S, respectively. The parameter c is called the delay of the spanner. We investigate the number of edge-disjoint spanners of a given delay that can exist in complete bipartite graphs. We de...
متن کاملEdge-disjoint Hamilton cycles in random graphs
We show that provided log n/n ≤ p ≤ 1 − n−1/4 log n we can with high probability find a collection of bδ(G)/2c edge-disjoint Hamilton cycles in G ∼ Gn,p, plus an additional edge-disjoint matching of size bn/2c if δ(G) is odd. This is clearly optimal and confirms, for the above range of p, a conjecture of Frieze and Krivelevich.
متن کاملEdge Disjoint Paths in Moderately Connected Graphs
We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as possible using paths that are mutually edge disjoint. This leads to a variety of classic NP-complete problems, for which approximability is not well understood. We show a polylogarithmic approximation algorithm for the undirected ...
متن کاملEdge Disjoint Hamilton Cycles in Knödel Graphs
All graphs considered here are simple and finite unless otherwise stated. LetCk (resp.Pk) denote the cycle (resp. path) on k vertices. For a graphG, if its edge set E(G) can be partitioned into E1,E2, . . . ,Ek such that 〈Ei〉 ∼= H, for all i, 1 ≤ i ≤ k, then we say thatH decomposesG.A k-factor ofG is a k-regular spanning subgraph of it. A k-factorization of a graphG is a partition of the edge s...
متن کاملEdge-Disjoint Paths in Permutation Graphs
In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge–disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2, respectively. We give a linear (O(|V |+ |E|)) algorithm to solve this problem on a permutation graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1978
ISSN: 0095-8956
DOI: 10.1016/0095-8956(78)90005-9